A performance analysis of multi-hop ad hoc networks with adaptive antenna array systems

摘要

Based on a stochastic geometry framework, we establish an analysis of themulti-hop spatial reuse aloha protocol (MSR-Aloha) in ad hoc networks. Wecompare MSR-Aloha to a simple routing strategy, where a node selects the nextrelay of the treated packet as to be its nearest receiver with a forwardprogress toward the final destination (NFP). In addition, performance gainsachieved by employing adaptive antenna array systems are quantified in thispaper. We derive a tight upper bound on the spatial density of progress ofMSR-Aloha. Our analytical results demonstrate that the spatial density ofprogress scales as the square root of the density of users, and the optimalcontention density (that maximizes the spatial density of progress) isindependent of the density of users. These two facts are consistent with theobservations of Baccelli et al., established through an analytical lower boundand through simulations.